mine adapt frequent close unlabel root tree data stream albert bifet ricard gavald close pattern power repres frequent pattern elimin redund inform propos approach mine close unlabel root tree adapt data stream chang time approach base effici represent tree low complex notion relax close tree lead line strategi adapt slide window techniqu deal time precis present gener methodolog identifi close pattern data stream galoi lattic theori methodolog develop close tree mine algorithm increment inctreenat slide window base wintreenat final mine close tree adapt data stream adatreenat knowledg work mine frequent close tree stream data vari time give experiment evalu propos algorithm 